Optimal replacement times — a general set-up
نویسندگان
چکیده
منابع مشابه
A Flow shop Production Planning Problem with basic period policy and Sequence Dependent set up times
Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...
متن کاملA three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...
متن کاملProperties of Optimal-Weighted Flowtime Policies with a Makespan Constraint and Set-up Times
We characterize optimal policies for the problem of allocating a single server to a set of jobs from N families. Each job is an instance of demand for an item and is associated with a family, a holding cost rate, and a mean processing time. Setup times are required to switch from one family to another, but not within a family. We consider the case in which the order of jobs within the family is...
متن کاملOptimal timing for intravascular administration set replacement.
BACKGROUND The tubing (administration set) attached to both venous and arterial catheters may contribute to bacteraemia and other infections. The rate of infection may be increased or decreased by routine replacement of administration sets. This review was originally published in 2005 and was updated in 2012. OBJECTIVES The objective of this review was to identify any relationship between the...
متن کاملAllocating a Server to Job Families with Set up Times
We consider the problem of allocating a single server to classes of jobs with random service times Each class of jobs possesses a holding cost rate general service distribution and a set up time and designates both a job family and a subtype within the family The set up time is required to e ect a switch from a job of one family to another The objective is to minimize the expected cost due to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 1986
ISSN: 0021-9002,1475-6072
DOI: 10.2307/3214185